Some Problems in Number Theory I: the Circle Problem
نویسندگان
چکیده
C.F. Gauss [Gaus1] [Gaus2] showed that the the number of lattice points in circles is the area, πt , up to a tolerance of order at most the circumference, i.e. the square root, O( √ t) . Sierpinski in 1904, following work of Voronoi [Vor] on the Dirichlet Divisor Problem, lowered the exponent in Gauss’s result to 1/3 [Sierp1] [Sierp2]. Further improvements that have been obtained will be described below. This paper provides a proof of the conjectured optimal error bound, O(t 1 4) . The present approach begins with a new asymptotic expression (9) for the number of lattice points in a circle. To obtain such an expression, one begins by embedding the integer lattice within a lattice refined by a factor Q that can be adjusted depending on the size of the circle. A convex polygon with vertices in the refined lattice approximates the circle. This number of lattice points can then be rewritten as a sum of standard trigonometric functions over the points of the refined lattice that lie within this polygon. An elementary generalized Euler-Maclaurin formula (the shortest possible such formula) for lattice sums in lattice polygons then provides an estimate of this sum in terms of certain integrals over the polygon. The lattice polytope structure permits such a formula in terms of Lebesgue measure. The integrals can in turn be approximated by integrals over circular regions; classically, such integrals yield Bessel functions. This procedure thus leads to an expression for the number of lattice points in a circle in terms of sums of Bessel functions or exponential sums. The expressions considered by Hardy, Landau and others have a similar form, but (9) differs in important features; for example, the sum is taken over lattice points in a square, whereas classically the summation pattern in asymptotic formulae for the lattice points in a circle retains the circular symmetry. The classical approach to any such sum next calls for application of Poisson summation, followed by lots of estimates, with the goal of arriving at a situation in which
منابع مشابه
Solving single facility goal Weber location problem using stochastic optimization methods
Location theory is one of the most important topics in optimization and operations research. In location problems, the goal is to find the location of one or more facilities in a way such that some criteria such as transportation costs, customer traveling distance, total service time, and cost of servicing are optimized. In this paper, we investigate the goal Weber location problem in which the...
متن کاملSingle Facility Goal Location Problems with Symmetric and Asymmetric Penalty Functions
Location theory is an interstice field of optimization and operations research. In the classic location models, the goal is finding the location of one or more facilities such that some criteria such as transportation cost, the sum of distances passed by clients, total service time, and cost of servicing are minimized. The goal Weber location problem is a special case of location mode...
متن کاملSolving a nurse rostering problem considering nurses preferences by graph theory approach
Nurse Rostering Problem (NRP) or the Nurse Scheduling Problem (NSP) is a complex scheduling problem that affects hospital personnel on a daily basis all over the world and is known to be NP-hard.The problem is to decide which members of a team of nurses should be on duty at any time, during a rostering period of, typically, one month.It is very important to efficiently utilize time and effort, ...
متن کاملExistence of triple positive solutions for boundary value problem of nonlinear fractional differential equations
This article is devoted to the study of existence and multiplicity of positive solutions to a class of nonlinear fractional order multi-point boundary value problems of the type−Dq0+u(t) = f(t, u(t)), 1 < q ≤ 2, 0 < t < 1,u(0) = 0, u(1) =m−2∑ i=1δiu(ηi),where Dq0+ represents standard Riemann-Liouville fractional derivative, δi, ηi ∈ (0, 1) withm−2∑i=1δiηi q−1 < 1, and f : [0, 1] × [0, ∞) → [0, ...
متن کاملSequencing Mixed Model Assembly Line Problem to Minimize Line Stoppages Cost by a Modified Simulated Annealing Algorithm Based on Cloud Theory
This research presents a new application of the cloud theory-based simulated annealing algorithm to solve mixed model assembly line sequencing problems where line stoppage cost is expected to be optimized. This objective is highly significant in mixed model assembly line sequencing problems based on just-in-time production system. Moreover, this type of problem is NP-hard and solving this probl...
متن کاملEffect of Magnetic Field and a Mode-I Crack 3D-Problem in Micropolar Thermoelastic Cubic Medium Possessing Under Three Theories
A model of the equations of two dimensional problems in a half space, whose surface in free of micropolar thermoelastic medium possesses cubic symmetry as a result of a Mode-I Crack is studied. There acts an initial magnetic field parallel to the plane boundary of the half- space. The crack is subjected to prescribed temperature and stress distribution. The formulation in the context of the Lor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008